Genome Rearrangements and Sorting by Reversals
نویسندگان
چکیده
Sequence comparison in molecular biology is in the beginning of a major paradigm shift a shift from gene comparison based on local mutations to chromosome comparison based on global rearrangements. In the simplest f o r m the problem of gene rearrangements corresponds to sorting by reversals, i.e. sorting of an array using reversals of arbitrary fragments. Kececioglu and Sankoff gave the first approximation algorithm for sorting by reversals with guaranteed error bound 2 and identified open problems related t o chromosome rearrangements. One of these problems is Gollan’s conjecture on the reversal diameter of the symmetric group. We prove this conjecture and furFigure 1: Evolution of Lobelia fervens
منابع مشابه
Sorting by Translocations Via Reversals Theory
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome rearrangements that “sorts” one genome into another. In this paper we focus on sorting a multi-chromosomal genome by translocations. We reveal new relationships between this problem and the well studied problem of sorti...
متن کاملA 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions
Recently, a new approach to analyze genomes evolving was proposed which is based on comparison of gene orders versus traditional comparison of DNA sequences (Sanko et al, 1992). The approach is based on the global rearrangements (e.g., inversions and transpositions of fragments). Analysis of genomes evolving by inversions and transpositions leads to a combinatorial problem of sorting by reversa...
متن کاملGenome Rearrangement Sorting Signed Permutations by Reversals
A model to study genome evolution can be constructed by representing genomes as permutations of genes, and compute the minimum number of rearrangements needed to convert one genome to the other. Under this model, the shorter the distance, the lesser is the evolutionary distance between the two species. However, every study of genome rearrangements involves solving the combinatorial problem refe...
متن کاملSorting by Weighted Reversals, Transpositions, and Inverted Transpositions
During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chromosome (like mitochondrial, chloroplast, or bacterial genomes), the biologically relevant genome rearrangements are (1) inversions--also called reversals--where a section of the genome is excised, reversed in orientation, and re...
متن کاملSorting by Reciprocal Translocations via Reversals Theory
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome rearrangements that transforms, or sorts, one genome into another. In this paper we focus on sorting a multi-chromosomal genome by translocations. We reveal new relationships between this problem and the well studied pr...
متن کامل